CODE 78. Jump Game

版权声明：本文为博主原创文章，转载请注明出处，谢谢!

版权声明：本文为博主原创文章，转载请注明出处：http://blog.jerkybible.com/2013/10/11/2013-10-11-CODE 78 Jump Game/

访问原文「CODE 78. Jump Game」

Given an array of non-negative integers, you are initially positioned at the first index of the array.
Each element in the array represents your maximum jump length at that position.
Determine if you are able to reach the last index.
For example:
A = [2,3,1,1,4], return true.
A = [3,2,1,0,4], return false.

public boolean canJump(int[] A) {
	// Note: The Solution object is instantiated only once and is reused by
	// each test case.
	if (A.length == 1) {
		return A[0] >= 0;
	}
	for (int i = 1; i < A.length; i++) {
		if (A[i - 1] - 1 < 0) {
			return false;
		} else {
			A[i] = Math.max(A[i - 1] - 1, A[i]);
		}
	}
	return true;
}